منابع مشابه
Time-Optimal Simulations of Networks by Universal Parallel Computers
For technological reasons, in a realistic parallel computer the processors have to communicate via a communication network with bounded degree. Thus the question for a \good" communication network comes up. In this paper we present such a network, a universal parallel computer (UPC) with the following properties: (i) It has optimal time-loss, namely O(log c) for simulating networks of degree c....
متن کاملAdditively efficient universal computers
We give evidence for a stronger version of the extended Church–Turing thesis: among the set of physically possible computers, there are computers that can simulate any other realizable computer with only additive constant overhead in space, time, and other natural resources. Complexity-theoretic results that hold for these computers can therefore be assumed to hold up to constant overhead on an...
متن کاملParallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers
This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...
متن کاملQuantum Nondemolition Monitoring of Universal Quantum Computers
It is proved that the halt scheme for a universal quantum computer originally proposed by Deutsch works without spoiling the computation. The “conflict” pointed out recently by Myers in the defintion of a universal quantum computer is shown to be only apparent. In the context of quantum nondemolition (QND) measurement, it is also shown that the output observable, an observable representing the ...
متن کاملDistributed simulation of parallel computers
We propose a method for emulating the behavior of your favorite MIMD computer on a network of workstations, so that programs written for the MIMD target can run on the distributed emulated version with just a recompilation. This is achieved by executing the computational parts as in the native run, with the message passing being simulated. The hardware of the target machine is simulated so that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 1983
ISSN: 0001-5903,1432-0525
DOI: 10.1007/bf00265559